Partial Bell Polynomials, Falling and Rising Factorials, Stirling Numbers, and Combinatorial Identities

نویسندگان

چکیده

In the paper, authors collect, discuss, and find out several connections, equivalences, closed-form formulas, combinatorial identities concerning partial Bell polynomials, falling factorials, rising extended binomial coefficients, Stirling numbers of first second kinds. These results are new, interesting, important, useful, applicable in number theory.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On degenerate numbers and polynomials related to the Stirling numbers and the Bell polynomials

In this paper, we consider the degenerate numbers Rn(λ) and polynomials Rn(x, λ) related to the Stirling numbers and the Bell polynomials. We also obtain some explicit formulas for degenerate numbers Rn(λ) and polynomials Rn(x, λ). AMS subject classification: 11B68, 11S40, 11S80.

متن کامل

Explicit Formulas and Combinatorial Identities for Generalized Stirling Numbers

In this paper, a modified approach to the multiparameter non-central Stirling numbers via differential operators, introduced by El-Desouky, and new explicit formulae of both kinds of these numbers are given. Also, some relations between these numbers and the generalized Hermite and Truesdel polynomials are obtained. Moreover, we investigate some new results for the generalized Stirling-type pai...

متن کامل

Some Identities Relating to Eulerian Polynomials and Involving Stirling Numbers

In the paper, the authors establish two identities, which can be regarded as nonlinear differential equations, for the generating function of Eulerian polynomials, find two identities for the Stirling numbers of the second kind, and present two identities for Eulerian polynomials and higher order Eulerian polynomials, pose two open problems about summability of two finite sums involving the Sti...

متن کامل

Bell and Stirling Numbers for Graphs

The Bell number B(G) of a simple graph G is the number of partitions of its vertex set whose blocks are independent sets of G. The number of these partitions with k blocks is the (graphical) Stirling number S(G, k) of G. We explore integer sequences of Bell numbers for various one-parameter families of graphs, generalizations of the relation B(Pn) = B(En−1) for path and edgeless graphs, one-par...

متن کامل

The Generalized Stirling and Bell Numbers Revisited

The generalized Stirling numbers Ss;h(n, k) introduced recently by the authors are shown to be a special case of the three parameter family of generalized Stirling numbers S(n, k;α, β, r) considered by Hsu and Shiue. From this relation, several properties of Ss;h(n, k) and the associated Bell numbers Bs;h(n) and Bell polynomials Bs;h|n(x) are derived. The particular case s = 2 and h = −1 corres...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Cmes-computer Modeling in Engineering & Sciences

سال: 2022

ISSN: ['1526-1492', '1526-1506']

DOI: https://doi.org/10.32604/cmes.2022.019941